Stability of periodic polling system with BMAP arrivals
نویسندگان
چکیده
This paper considers the stability of BMAP/GI/1 periodic polling models with mixed service disciplines. The server attends the N stations in a repeating sequence of stages. Customers arrive to the stations according to batch Markov arrival processes (BMAP s). The service times of the stations are general independent and identically distributed. The characterization of global stability of the system, the order of instability of stations and the necessary and sufficient condition for the stability are given. Our stability analysis is based on the investigation of the embedded Markov chains at the polling epochs, which allows a much simpler discussion than the formerly applied approaches. This work can also be seen as a survey on stability of a quite general set of polling models, since the majority of the known results of the field is a special case of the presented ones.
منابع مشابه
On the relationships among queue lengths at arrival, departure, and random epochs in the discrete-time queue with D-BMAP arrivals
We consider finiteand infinite-capacity queues with discrete-time batch Markovian arrival processes (D-BMAP) under the assumption of the Late Arrival System with Delayed Access as well as the Early Arrival System. Using simple arguments such as the balance equation, “rate in = rate out,” we derive relationships among the stationary queue lengths at arrival, at departure, and at random epochs. S...
متن کاملPolling systems with periodic server routing in heavy traffic: renewal arrivals
This paper considers heavy-traffic limit theorems for polling models with periodic server routing with general renewal arrivals and with mixtures of gated and exhaustive service policies, in a general parameter setting. We provide a strong conjecture for the limiting waiting-time distribution in a general parameter setting when the load tends to 1, under proper heavy-traffic scalings. The resul...
متن کاملPeriodicity in the Transient Regime of Exhaustive Polling Systems
We consider an exhaustive polling system with three nodes in its transient regime under a switching rule of generalized greedy type. We show that, for the system with Poisson arrivals and service times with finite second moment, the sequence of nodes visited by the server is eventually periodic almost surely. To do this, we construct a dy-namical system, the triangle process, which we show has ...
متن کاملStability Conditions for the BMAP/G/1 Queue with Level Dependent Arrivals
Electronic copies of technical reports are available: Via FTP: URL ftp://ftp.informatik.uni-trier.de/pub/Users-Root/reports Via WWW: URL http://www.informatik.uni-trier.de/Reports/Current.html Via email: Send a mail to [email protected], subject ’HELP’, for detailed instructions Printed copies: Trierer Forschungsberichte Fachbereich IV Mathematik / Informatik Universitat Trier ..
متن کاملMonotonicity and stability of periodic polling models
This paper deals with the stability of periodic polling models with mixed service policies. The interarrivals to all queues are independent and exponentially distributed and the service and the switch-over times are independent with general distributions. The necessary and suucient condition for the stability of such polling systems is established. The proof is based on the stochastic monotonic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- European Journal of Operational Research
دوره 197 شماره
صفحات -
تاریخ انتشار 2009